Emendation of Undesirable Attack on Multiparty Data Sharing With Anonymous Id Assignment Using AIDA Algorithm
نویسندگان
چکیده
منابع مشابه
Efficient and Secure Data Sharing By Applying AES Algorithm with Anonymous Id Assignment
Security is a basic requirement of an organization in the world to keep their information secure from their competitors. Various techniques and algorithms were developed by research in order to achieve secure data sharing. We propose a technique for anonymous sharing of private data between N parties is developed. This technique is used to allocate these node ID numbers ranging from 1 to N and ...
متن کاملLiterature Survey on Secure Multiparty Anonymous Data Sharing
The popularity of internet as a communication medium whether for personal or business requires anonymous communication in various ways. Businesses also have legitimate reasons to make communication anonymous and avoid the consequences of identity revelation. The problem of sharing privately held data so that the individuals who are the subjects of the data cannot be identified has been research...
متن کاملAn Efficient Data Security Mechanism in Cloud Computing Using Anonymous ID Algorithm
Cloud computing has evolved from a risky and confusing concept to a strategy that organization large and small are beginning to adopt as part of their to overall computing strategy. Cloud computing is a method of providing a set of shared computing resources that includes application, computing, storage, netorking, development and deployment platforms as well as business processes.. Research on...
متن کاملWeb Attack Detection Using ID
Decision tree learning algorithms have been successfully used in knowledge discovery. They use induction in order to provide an appropriate classification of objects in terms of their attributes, inferring decision tree rules. This paper reports on the use of ID3 to Web attack detection. Even though simple, ID3 is sufficient to put apart a number of Web attacks, including a large proportion of ...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Innovative Research in Science, Engineering and Technology
سال: 2015
ISSN: 2347-6710,2319-8753
DOI: 10.15680/ijirset.2015.0402037